Kater: Automating Weak Memory Model Metatheory and Consistency Checking

The metatheory of axiomatic weak memory models covers questions like the correctness compilation mappings from one model to another and local program transformations according a given model---topics usually requiring lengthy human investigation. We show that these can be solved by answering more basic question: "Given two models, is weaker than other?" Moreover, for wide class we this question reduced language inclusion problem between regular languages, which decidable. Similarly, implementing an efficient check whether execution graph consistent has required non-trivial manual effort. Again, such checks derived automatically incremental consistency incorporated in GenMC, state-of-the-art checker concurrent programs. As result, get first time- space-efficient bounded verifier taking as input parameter.